Mainpage Page of n-Queens Problem
Version 1.0
What is the maximum number of queens that can be placed on an chessboard such that no two attack one another? The answer is n*n queens, which gives eight queens for the usual 8x8 board (Madachy 1979; Steinhaus 1999, p. 29). The number of different ways the n queens can be placed on an n*n chessboard so that no two queens may attack each other for the first few n are 1, 0, 0, 2, 10, 4, 40, 92, ... (Sloane's A000170; Madachy 1979; Steinhaus 1999, p. 29). The number of rotationally and reflectively distinct solutions are 1, 0, 0, 1, 2, 1, 6, 12, 46, 92, ... (Sloane's A002562; Dudeney 1970; p. 96). The 12 distinct solutions for n=8 are illustrated above, and the remaining 80 are generated by rotation and reflection (Madachy 1979, Steinhaus 1999).
Generated on Sun Dec 18 19:26:13 2005 for n-Queens Problem by
1.4.5